Ela the Maximum Order of Reduced Square (0, 1)-matrices with a given Rank∗
نویسنده
چکیده
The maximum order of a square (0, 1)-matrix A with a fixed rank r is considered, provided A has no repeated rows or columns. When A is the adjacency matrix of a graph, Kotlov and Lovász [A. Kotlov and L. Lovász. The rank and size of graphs. J. Graph Theory, 23:185–189, 1996.] proved that the maximum order equals Θ(2r/2). In this note, it is showed that this result remains correct if A is symmetric, but becomes false if symmetry is not required.
منابع مشابه
Ela Fast Computing of the Moore - Penrose Inverse Matrix
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.
متن کاملThe maximum order of reduced square (0,1)-matrices with a given rank
The maximum order of a square (0, 1)-matrix A with a fixed rank r is considered, provided A has no repeated rows or columns. When A is the adjacency matrix of a graph, Kotlov and Lovász [A. Kotlov and L. Lovász. The rank and size of graphs. J. Graph Theory, 23:185–189, 1996.] proved that the maximum order equals Θ(2r/2). In this note, it is showed that this result remains correct if A is symmet...
متن کاملEla on the Minimum Rank of Not Necessarily Symmetric Matrices: a Preliminary Study∗
The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...
متن کاملEla Binary Ranks and Binary Factorizations of Nonnegative Integer Matrices
Abstract. A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer matrices that attain the lower bound are characterized. Moreover, binary ranks of nonnegative intege...
متن کاملEla Minimum Rank, Maximum Nullity, and Zero Forcing Number of Simple Digraphs
A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity. Cut-vertex reduction formulas for minimum rank and zero forcing number for simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012